Active Context - Free
نویسندگان
چکیده
An Active Context-Free Game is a game with two players (ROMEO and JULIET) on strings over a finite alphabet. In each move, JULIET selects a position of the current word and ROMEO rewrites the corresponding letter according to a rule of a context-free grammar. JULIET wins if a string of the regular target language is reached. The complexity of deciding the existence of winning strategies for JULIET is investigated, depending on properties of the grammar and of the target language, and on restrictions on the strategy.
منابع مشابه
Sodium Bismuthate: An Efficient Catalyst for the One-pot Synthesis of Biologically Active Spiro[4H-pyran] Derivativesunder Solvent-free Conditions
An efficient sodium bismuthate (NaBiO3) synthesis of biologically active spiro[4H-pyran]derivatives has been accomplished via one-pot three-condensation of isatin/acenaphthequinone, malononitrile and different reagents including 1,3-dicrbonyl compounds, α-naphthol and 4-hydroxycumarin under solvent-free conditions. The notable advantages of the present procedure are: eco-friendly, environmental...
متن کاملSolvent-free Biginelli Reaction Catalyzed to Synthesis of Biologically Active 3,4-dihydropyrimidin-2-(1H) –ones/thiones Derivatives
A convenient and highly efficient procedure for the synthesis of 3,4-dihydropyrimidin-2-(1H)-one/thione derivatives via one-pot three-component Biginelli condensation of arylaldehydes,urea/thiourea and ethyl/methyl acetoacetate in the presence of Zn(SO4)2.7H2Oas anefficient, readily and inexpensive catalyst under solvent-free conditions have been studied. Thisprotocol ha...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملRegulated Array Grammars of Finite Index. Part I: Theoretical Investigations
We consider regulated (n-dimensional) context-free array grammars of nite index, i.e., with a limited number of active areas. This research is motivated by the observation that in several practical applications of array grammars only such a bounded number of active areas is observed. Combined with diierent methods known from regulated rewriting (e.g., matrix grammars, programmed grammars, gramm...
متن کاملTaking Primitive Optimality Theory Beyond the Finite State
Primitive Optimality Theory (OTP) (Eisner, 1997a; Albro, 1998), a computational model of Optimality Theory (Prince and Smolensky, 1993), employs a finite state machine to represent the set of active candidates at each stage of an Optimality Theoretic derivation, as well as weighted finite state machines to represent the constraints themselves. For some purposes, however, it would be convenient ...
متن کامل